منابع مشابه
A Graph Invariant and 2-factorizations of a graph
A spanning subgraph of a graph G is called a [0,2]-factor of G, if 0 ( ) 2 d x for ( ) x V G . is a union of some disjoint cycles , paths and isolate vertices , that span the graph G. It is easy to get a [0,2]-factor of G and there would be many of [0,2]-factors for a G. A characteristic number for a [0,2]-factor, which reflect the number of the paths and isolate vertices in it,. The [0...
متن کاملGraph Invariant Kernels
We introduce a novel kernel that upgrades the Weisfeiler-Lehman and other graph kernels to effectively exploit highdimensional and continuous vertex attributes. Graphs are first decomposed into subgraphs. Vertices of the subgraphs are then compared by a kernel that combines the similarity of their labels and the similarity of their structural role, using a suitable vertex invariant. By changing...
متن کاملA New Graph Invariant for Graph Isomorphism: Probability Propagation Matrix
The graph isomorphism problem is to determine whether two given graphs are iso-morphic or not. In this paper, we present a new graph invariant, called the probability propagation matrix. By means of this graph invariant, we present a heuristic algorithm for the problem. The algorithm is easy to implement and highly parallelizable.
متن کاملA graph-theoretical invariant of topological spaces
Given a topological space T and a finite subset T0 of T , we associate two graphs with T and T0 that, under rather mild conditions, turn out to be a block graph and a tree, respectively. This construction is of interest, e.g., in the context of phylogenetic analysis where T may model a full ‘‘orbit’’ of a dynamical branching process, and T0 the set of its branching points. © 2008 Elsevier Ltd. ...
متن کاملThe critical exponent: a novel graph invariant
A surprising result of FitzGerald and Horn (1977) shows that A◦α := (aα ij) is positive semidefinite (p.s.d.) for every entrywise nonnegative n× n p.s.d. matrix A = (aij) if and only if α is a positive integer or α ≥ n− 2. Given a graph G, we consider the refined problem of characterizing the setHG of entrywise powers preserving positivity for matrices with a zero pattern encoded by G. Using al...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 1989
ISSN: 0747-7171
DOI: 10.1016/s0747-7171(89)80048-3